Reverse-delete algorithm

The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighed graph. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected part of the graph. The set of these minimum spanning trees is called a minimum spanning forest, which contains every vertex in the graph.

This algorithm is a greedy algorithm, choosing the best choice given any situation. It is the reverse of Kruskal's algorithm, which is another greedy algorithm to find a minimum spanning tree. Kruskal’s algorithm starts with an empty graph and adds edges while the Reverse-Delete algorithm starts with the original graph and deletes edges from it. The algorithm works as follows:

• Start with graph G, which contains a list of edges E.
• Go through E in decreasing order of edge weights.
• For each edge, check if deleting the edge will further disconnect the graph.
• Perform any deletion that does not lead to additional disconnection.

Contents 1 Pseudocode 2 Example 3 Running time 4 See also 5 References

Pseudocode

 1  function ReverseDelete(edges[] E)
 2    sort E in decreasing order
 3    Define an index i ← 0
 4    while i < size(E)
 5       Define edge temp ← E[i]
 6	   delete E[i]
 7	   if temp.v1 is not connected to temp.v2
 8             E[i] ← temp
 9   	   i ← i + 1
 10   return edges[] E

In the above the graph is the set of edges E with each edge containing a weight and connected vertices v1 and v2.

Example

In the following example green edges are being evaluated by the algorithm and red edges have been deleted.

	This is our original graph. The numbers near the edge indicate their edge weight.
	The algorithm will start with the maximum weighted edge, which in this case is DE with an edge weight of 15. Since deleting edge DE does not further disconnect the graph it is deleted.
	The next largest edge is FG so the algorithm will check if deleting this edge will further disconnect the graph. Since deleting the edge will not further disconnect the graph, the edge is then deleted.
	The next largest edge is edge BD so the algorithm will check this edge and delete the edge.
	The next edge to check is edge EG, which will not be deleted since it would disconnect node G from the graph. Therefore, the next edge to delete is edge BC.
	The next largest edge is edge EF so the algorithm will check this edge and delete the edge.
	The algorithm will then search the remaining edges and will not find another edge to delete; therefore this is the final graph returned by the algorithm.

Running time

The algorithm can be shown to run in O(E log E (log log E)³) time, where E is the number of edges and V is the number of vertices. This bound is achieved as follows:

• sorting the edges by weight using a comparison sort in O(E log E) time
• E iterations of loop
• deleting in O(1) time
• connectivity checked in O(logV (log log V)³) time (Thorup 2000).

Equally, the running time can be considered O(E log V (log log V)³) because the largest E can be is V². Remember that logV² = 2 * logV, so 2 is a multiplicative constant that will be ignored in big-O notation.

See also

• Kruskal's algorithm
• Prim's algorithm
• Borůvka's algorithm
• Dijkstra's algorithm

References

• Kleinberg, Jon; Tardos, Éva (2006), Algorithm Design, New York: Pearson Education, Inc. .
• Thorup, Mikkel (2000), "Near-optimal fully-dynamic graph connectivity", Proc. 32nd ACM Symposium on Theory of Computing, pp. 343–350, doi:10.1145/335305.335345 .